A Comparative Study of CMA-ES on Large Scale Global Optimisation
نویسندگان
چکیده
In this paper, we investigate the performance of CMA-ES on large scale non-separable optimisation problems. CMA-ES is a robust local optimiser that has shown great performance on small-scale nonseparable optimisation problems. Self-adaptation of a covariance matrix makes it rotational invariant which is a desirable property, especially for solving non-separable problems. The focus of this paper is to compare the performance of CMA-ES with Cooperative Co-evolutionary Algorithms (CCEAs) for large scale global optimisation (on problems with up to 1000 real-valued variables). Since the original CMA-ES is incapable of handling problems with more than several hundreds dimensions, sep-CMA-ES was developed using only the diagonal elements of the covariance matrix. In this paper sep-CMA-ES is compared with several existing CCEAs. Experimental results revealed that the performance of sep-CMA-ES drops significantly when the dimensionality of the problem increases. However, our results suggest that the rotational invariant property of CMA-ES can be utilised in conjunction with a CCEA to further enhance its capability to handle large scale optimisation problems.
منابع مشابه
Default policies for global optimisation of noisy functions with severe noise
Global optimisation of unknown noisy functions is a daunting task that seems to appear in domains ranging from games to control problems to meta-parameter optimisation for machine learning. We show how to incorporate heuristics to Stochastic Simultaneous Optimistic Optimization (STOSOO), a global optimisation algorithm that has very weak requirements from the function. In our case, heuristics c...
متن کاملMemetic algorithms based on local search chains for large scale continuous optimisation problems: MA-SSW-Chains
Nowadays, large scale optimisation problems arise as a very interesting field of research, because they appear in many real-world problems (bio-computing, data mining, etc.). Thus, scalability becomes an essential requirement for modern optimisation algorithms. In a previous work, we presented memetic algorithms based on local search chains. Local search chain concerns the idea that, at one sta...
متن کاملA A Competitive Divide-and-Conquer Algorithm for Unconstrained Large-Scale Black-Box Optimization
This paper proposes a competitive divide-and-conquer algorithm for solving large-scale black-box optimization problems, where there are thousands of decision variables, and the algebraic models of the problems are unavailable. We focus on problems that are partially additively separable, since this type of problem can be further decomposed into a number of smaller independent sub-problems. The ...
متن کاملA hybrid CMA-ES and HDE optimisation algorithm with application to solar energy potential
This paper describes the results of initial experiments to apply computational algorithms to explore a large parameter space containingmany variables in the search for an optimal solution for the sustainable design of an urban development using a potentially complicated fitness function. This initial work concentrates on varying the placement of buildings to optimise solar irradiation availabil...
متن کاملA multi-tier adaptive grid algorithm for the evolutionary multi-objective optimisation of complex problems
The multi-tier Covariance Matrix Adaptation Pareto Archived Evolution Strategy (m-CMA-PAES) is an evolutionary multi-objective optimisation (EMO) algorithm for real-valued optimisation problems. It combines a nonelitist adaptive grid based selection scheme with the efficient strategy parameter adaptation of the elitist CovarianceMatrix Adaptation Evolution Strategy (CMA-ES). In the original CMA...
متن کامل